DETECTION OF FLUX EMERGENCE, SPLITTING, MERGING, AND CANCELLATION OF NETWORK FIELD. I. SPLITTING AND MERGING
نویسندگان
چکیده
منابع مشابه
Merging and Splitting Eigenspace Models
We present new deterministic methods that given two eigenspace models, each representing a set of n-dimensional observations will: (1) merge the models to yield a representation of the union of the sets; (2) split one model from another to represent the difference between the sets; as this is done, we accurately keep track of the mean. These methods are more efficient than computing new eigensp...
متن کاملVisualization of Splitting and Merging Processes
Information about objects that split or merge is often generated dynamically as a by-product of computation or in the observation of real-world behavior. Visualization tools for such processes must not only reveal temporal patterns and spatial organization but should also accommodate on-the-fly generation of split-merge information. This paper develops a formal structure for split-merge process...
متن کاملDetecting Merging and Splitting using Origin Analysis
Merging and splitting source code artifacts is a common activity during the lifespan of a software system; as developers rethink the essential structure of a system or plan for a new evolutionary direction, so must they be able to reorganize the design artifacts at various abstraction levels as seems appropriate. However, while the raw effects of such changes may be plainly evident in the new a...
متن کاملSplitting and merging of packet traffic: Measurement and modelling
This paper concerns the modelling of Internet packet traffic. In previous work we showed that a Bartlett–Lewis point process, as a model of packet arrivals on backbone links, enjoys strong physical backing and can predict key features. It is based on the surprising empirical observation that flows can often be considered independent for the purpose of modelling packet arrival times. We extend t...
متن کاملLearning of Latent Class Models by Splitting and Merging Components
A problem in learning latent class models (also known as naive Bayes models with a hidden class variable) is that local maximum parameters are often found. This leads not only to suboptimal parameters, but also to a wrong number of classes (components) for a hidden variable. The standard solution of having many random starting points for the EM algorithm is often too expensive computationally. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Astrophysical Journal
سال: 2012
ISSN: 0004-637X,1538-4357
DOI: 10.1088/0004-637x/752/2/149